Extended superposed quantum-state initialization using disjoint prime implicants
نویسندگان
چکیده
منابع مشابه
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants (ESQUID) is a new algorithm for generating quantum arrays for the purpose of initializing a desired quantum superposition. The quantum arrays generated by this algorithm almost always use fewer gates than other algorithms and in the worst case use the same number of gates. These improvements are achieved by allowin...
متن کاملEvaluate Prime Implicants Description
data.logicfs Example Data of logicFS Description data.logicfs contains two objects: a simulated matrix data.logicfs of 400 observations (rows) and 15 variables (columns) and a vector cl.logicfs of length 400 containing the class labels of the observations. Each variable is categorical with realizations 1, 2 and 3. The first 200 observations are cases, the remaining are controls. If one of the f...
متن کاملPrime Implicants and Belief Update
Adaptation is one of the most important capabilities that an intelligent agent should present. In order to provide this capability to logical-based agents, the Belief Change area proposes methods to incorporate new information in a belief set. Properties like consistency and minimal change guide the change process. The notion of minimal change is usually associated with a closeness criterion ba...
متن کاملWidening ROBDDs with Prime Implicants
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...
متن کاملPrime Implicates and Prime Implicants in Modal Logic: Extended and Revised Version
The purpose of this paper is to examine how the propositional notions of prime implicates and prime implicants might be appropriately extended to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for K. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2009
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.79.052310